Algebraically recurrent random walks on groups

نویسندگان

  • Itai Benjamini
  • Hilary Finucane
  • Romain Tessera
چکیده

Initial steps are presented towards understanding which finitely generated groups are almost surely generated as a semigroup by the path of a random walk on the group.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recurrence and ergodicity of random walks on linear groups and on homogeneous spaces

We discuss recurrence and ergodicity properties of random walks and associated skew products for large classes of locally compact groups and homogeneous spaces. In particular we show that a closed subgroup of a product of finitely many linear groups over local fields supports a recurrent random walk if and only if it has at most quadratic growth. We give also a detailed analysis of ergodicity p...

متن کامل

Random Walks on Infinite Graphs and Groups — a Survey on Selected Topics

Contents 1. Introduction 2 2. Basic definitions and preliminaries 3 A. Adaptedness to the graph structure 4 B. Reversible Markov chains 4 C. Random walks on groups 5 D. Group-invariant random walks on graphs 6 E. Harmonic and superharmonic functions 6 3. Spectral radius, amenability and law of large numbers 6 A. Spectral radius, isoperimetric inequalities and growth 6 B. Law of large numbers 9 ...

متن کامل

On the Recurrence of Random Walks

We define random walks on Rd and recurrent points and demonstrate that a random walk’s recurrence to 0 implies its recurrence to each of its possible points. We then prove two different necessary and sufficient conditions for the recurrence of random walks. Finally, we employ these results to provide conditions under which random walks on R and on R2 are recurrent as well as prove that when d ≥...

متن کامل

2 9 Ja n 20 04 DEGREES OF TRANSIENCE AND RECURRENCE AND HIERARCHICAL RANDOM WALKS

The notion of degree and related notions concerning recurrence and transience for a class of Lévy processes on metric Abelian groups are studied. The case of random walks on a hierarchical group is examined with emphasis on the role of the ultrametric structure of the group and on analogies and differences with Euclidean random walks. Applications to separation of time scales and occupation tim...

متن کامل

A Note on Recurrent Random Walks

For any recurrent random walk (Sn)n≥1 on R, there are increasing sequences (gn)n≥1 converging to infinity for which (gnSn)n≥1 has at least one finite accumulation point. For one class of random walks, we give a criterion on (gn)n≥1 and the distribution of S1 determining the set of accumulation points for (gnSn)n≥1. This extends, with a simpler proof, a result of K.L. Chung and P. Erdös. Finally...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012